Performance of Hybrid Concatenated Trellis Codes CPFSK with Iterative Decoding over Fading Channels

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance of Hybrid Concatenated Trellis Codes CPFSK with Iterative Decoding over Fading Channels

Concatenation is a method of building long codes out of shorter ones, it attempts to meet the problem of decoding complexity by breaking the required computation into manageable segments. Concatenated Continuous Phase Frequency Shift Keying (CPFSK) facilitates powerful error correction. CPFSK also has the advantage of being bandwidth efficient and compatible with non-linear amplifiers. Bandwidt...

متن کامل

Hybrid Concatenated Codes and Iterative Decoding

A hybrid concatenated code with two interleavers is the parallel concatenation of an encoder, which accepts the permuted version of the information sequence as its input, with a serially concatenated code, which accepts the unpermuted information sequence. The serially concatenated code consists of an outer encoder, an interleaver, and an inner encoder. An upper bound to the average maximum-lik...

متن کامل

Hybrid ARQ using Serial Concatenated Convolutional Codes over Fading Channels

In this paper, we propose and analyze a new hybrid FEC/ARQ scheme using rate compatible punctured serial concatenated convolutional codes (SCCCs) which is suitable for flat-fading channels. Puncturing increases the transmitted code rate, and the rate compatibility criterion allows incremental redundancy to be transmitted after each decoding failure according to a code-combining type-II Hybrid A...

متن کامل

Graph-based iterative decoding algorithms for parity-concatenated trellis codes

In this paper, we construct parity-concatenated trellis codes in which a trellis code is used as the inner code and a simple parity-check code is used as the outer code. From the Tanner–Wiberg–Loeliger (TWL) graph representation, several iterative decoding algorithms can be derived. However, since the graph of the parity-concatenated code contains many short cycles, the conventional min-sum and...

متن کامل

Performance Analysis of Space Time Trellis Codes Over Nakagami Fading & Rayleigh Fading Channels: With Comparative Analysis

Space-time trellis codes provide both diversity gain and coding gain. There are two different design criteria proposed for spacetime trellis codes (STTCs), namely the rank and determinant criteria (RDC) and the Euclidean distance design criteria (EDC). In this paper, we present the performance of STTCs over Nakagami fading channels. Our results show that the STTCs designed for Rayleigh fading c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Distributed and Parallel systems

سال: 2011

ISSN: 2229-3957

DOI: 10.5121/ijdps.2011.2207